A Set-to-Set Disjoint Paths Routing Algorithm in a Torus-Connected Cycles Network

Torus-Connected Cycles (TCC) have been recently proposed as interconnection network for massively parallel systems. In order to increase system dependability and interprocessor communication performance, disjoint paths routing is critical. In this paper, we focus on the set-to-set disjoint paths routing problem which consists in select mutually node-disjoint paths between two sets of nodes. As a pre-requisite, we first propose a time-optimal solution to the 3-set-to-set disjoint paths routing problem in a k-ary ndimensional torus, including its empirical evaluation. Consequently, we can solve the set-to-set disjoint paths routing problem in a TCC(k,n) with paths of lengths at most kn2 +2n in O(kn2) time. keywords: torus, many-to-many, parallel system, faulttolerance, dependable, supercomputer.